Semantically transparent linking in HPSG

نویسندگان

  • Jean-Pierre Koenig
  • Anthony Davis
چکیده

Most researchers now agree that subcategorization correlates significantly with semantics. But this semantic component of linking has proved elusive. Most, if not all, theories of linking have, in pratice, resorted to constructs that are syntactic diacritics. We show in this paper that the implicit syntactic diacritics that plague the basic linking constraints posited in at least some of these theories can be eliminated, provided that (i) the metalanguage in which linguistic constraints are written allows for true implicational statements; (ii) one is willing to slightly increase the number of linking constraints. We focus in particular on the linking theory presented in Davis and Koenig 2000, Davis 2001, and Koenig and Davis 2000, but we maintain that our arguments apply, mutatis mutandis, to many other linking theories. We note some of the consequences of this view of linking, including: linking constraints are stated in terms of semantically natural classes of situations, a single entailment of a verb’s argument is sufficient to determine its linking, and interaction among linking constraints restricts the range of possible lexical items. Most researchers now agree that subcategorization correlates significantly with semantics (see, among others, Foley and Van Valin (1984), Pinker (1989), Jackendoff (1990), Levin (1993), Goldberg (1995), Wechsler (1995b), Davis and Koenig (2000b)). To put it in motto form, knowing the meaning of a verb is to a large extent knowing its context of occurrence. But this semantic component of linking has proved elusive. Most, if not all, theories of linking have, in pratice, resorted to constructs that are syntactic diacritics. We show in this paper that the implicit syntactic diacritics that plague the basic linking constraints posited in at least some of these various theories can be eliminated, provided that (i) the metalanguage in which linguistic constraints are written allows for true implicational statements; (ii) one is willing to slightly increase the number of linking constraints. Because of space considerations, we focus in particular on the linking theory presented in Davis and Koenig (2000b), Davis (2001), and Koenig and Davis (2001). But we believe our arguments apply, mutatis mutandis, to many other linking theories. 1 Syntactic diacritics in semantically-based linking theories We first briefly present the approach to linking in HPSG described in Davis and Koenig (2000) and Davis (2001). This linking theory is based on three crucial ideas: (1) A multiple inheritance hierarchy of semantic relations; (2) a multiple inheritance hierarchy of predicator types defined by how they link attribute values within their CONTENT to members of the ARG-ST list (more precisely, to the situational nucleus of their CONTENT); (3) a metatheoretical constraint on the relationship between the hierarchy of semantic relations and the hierarchy of predicator types. We thank Detmar Meurers for discussing some of the issues raised in this paper. All remaining errors are solely ours. Consider how this theory accounts for the linking of arguments displayed in the following simple transitive sentence. (1) Sandy moved the ball. The fact that, for all English transitive verbs that denote causes changing the states of entities, the cause is realized as the subject of its active form, and the entity changing state is realized as the direct object, is modeled through the interaction of three constraints. First, the CONTENT of move includes a semantic relation which is a subtype of both act-rel and und-rel. This is illustrated in figure 1 where lines between nodes labelling semantic relations indicate a subtype-supertype relation. Such a semantic hierarchy, which encodes the (linguistically relevant) relations between categories of situations, helps restrict the grammatical constraints on the realization of semantic arguments to the proper semantically-defined class of verbs. rel

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Implemented HPSG Grammar for SHARDS

This report is an extension of (Gregory 2001) and presents an overview of the implementation of the HPSG grammar currently used in SHARDS —a Semantically-based HPSG Approach to the Resolution of Dialogue Fragments (Ginzburg, Gregory, and Lappin 2001). The grammar is based on the theoretical framework presented in (Ginzburg and Sag 2001) and it is encoded in ProFIT (Erbach 1995).

متن کامل

Evaluating Contribution of Deep Syntactic Information to Shallow Semantic Analysis

This paper presents shallow semantic parsing based only on HPSG parses. An HPSG-FrameNet map was constructed from a semantically annotated corpus, and semantic parsing was performed by mapping HPSG dependencies to FrameNet relations. The semantic parsing was evaluated in a Senseval-3 task; the results suggested that there is a high contribution of syntactic information to semantic analysis.

متن کامل

On the copula: from a Fregean to a Montagovian treatment

The analysis of the copula as a semantically vacuous word in mainstream HPSG is appropriate for some of its uses, such as the progressive and the passive, but not for its use in clauses with a predicate complement. In such clauses the copula denotes a relation of coreference between the indices of the subject and the predicate complement. 1 The Fregean treatment In HPSG the copula is commonly t...

متن کامل

Modularity of grammatical constraints in HPSG-based grammar implementations

This paper is a contribution to the discussion of the choices involved in implementing HPSG-based grammars and their consequences on the modularity and reusability of grammatical resources, a central issue in multi-lingual grammar development. Based on two examples from the English Resource Grammar (Flickinger et al., 2000), the treatment of unbounded dependencies and the analysis of optional a...

متن کامل

Learning Stochastic Lexicalized Tree Grammars from Hpsg

We 1 present a method for automatically extracting a Stochastic Lexicalized Tree Grammar (SLTG) from an HPSG source grammar and a given corpus. Processing of a SLTG is performed by a specialized fast parser. The approach has been tested on a large English grammar and has been shown to achieve a speed-up by a factor of better than 10 compared to parsing with a highly tuned HPSG parser. Our appro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003